Supervisory Control of Concurrent Discrete Event Systems

In this paper, we are interested in the control of Concurrent Discrete Event Systems defined by a collection of components that interact with each other. We investigate the computation of the supremal controllable language contained in the one of the specification. It is shown that by ensuring on the specification a new language property, called partial controllability condition with respect to some approximations of the plant derived from the behavior of each component, a supervisor can be derived such that the behavior of the controlled plant corresponds to the supremal controllable language contained in the one of the specification. This computation is performed without having to build the whole plant, hence avoiding the state space explosion induced by the concurrent nature of the plant. Key-words: Discrete Event Systems, Supervisory Control Problem, Concurrent Finite State Machines, Partial controllability